منابع مشابه
On connected resolvability of graphs
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a connected resolving set for G if distinct vertices of G have distinct representations with respect to W and the...
متن کامل2-Size Resolvability in Graphs
A vertex u in a graph G resolves a pair of distinct vertices x, y of G if the distance between u and x is different from the distance between u and y. A set W of vertices in G resolves the graph G if every pair of distinct vertices of G is resolved by some vertices in W . The metric dimension of a graph, denoted by dim(G), is the smallest cardinality of a resolving set. A resolving set W for a ...
متن کاملD-resolvability of vertices in planar graphs
It is well known that a vertex of degree 5 in a planar graph is not Dreducible. However, it remains an open question whether all vertices in such a graph areD-resolvable. If so, it would be a stronger result than mere 4-colorability. To investigate the question, we designed and implemented two algorithms, one to 4-color a planar graph and the other to generate internally 6-connected triangulati...
متن کاملConditional resolvability in graphs: a survey
For an ordered setW = {w1,w2, . . . ,wk} of vertices and a vertexv in a connected graphG, the code of v with respect toW is the k-vector cW (v)= (d(v,w1),d(v,w2), . . . ,d(v,wk)), where d(x,y) represents the distance between the vertices x andy . The setW is a resolving set for G if distinct vertices of G have distinct codes with respect to W . The minimum cardinality of a resolving set for G i...
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2003
ISSN: 0011-4642,1572-9141
DOI: 10.1023/b:cmaj.0000024524.43125.cd